The Shortest Path of Touring Lines given in the Plane
نویسندگان
چکیده
Given two points p, q and a sequence of n lines (n>1) in the plane, we want to find the shortest path of touring all the given lines that starts at p and ends at q. In this paper, we solve the problem by reducing it to the problem of finding the shortest path that tours all the segments in a convex polygon from p to q. We first introduce how to construct the convex polygon. Then, we propose the solution to process the intersections of two adjacent segments by crossing over two segments. Finally, based on rubber-band algorithm, a new algorithm is proposed which can find the shortest path of touring segments in a convex polygon, and the O(n 2 ) running time can be obtained for this problem, which improves the previous O(n 3 logn) time. Our algorithm is simple and efficient.
منابع مشابه
Approximate Algorithms for Touring a Sequence of Polygons
Given two points p and q and a finite number of simple polygons in a plane. The basic version of a touring-a-sequence-of-polygons problem (in brief: a touring polygons problem, TPP) is how to find a shortest path such that it starts at p, then it visits these polygons in the given order, and finally it ends at q. This paper describes approximate algorithms for different versions of touring poly...
متن کاملOn The Watchman Route Problem and Its Related Problems
We propose to study the watchman route problem and its related problems. The watchman route problem asks a shortest closed path within a given polygon so that every point in the polygon is visible from at least one point on the path. We first discuss the watchman route problem for simple polygons, for polygonal domains, and for arrangements of lines and line segments. We then focus on a problem...
متن کاملA New Algorithm for the Shortest Path of Touring Disjoint Convex Polygons
Given a start point s, a target point t, and a sequence of k disjoint convex polygons in the plane, finding the shortest path from s to t which visits each convex polygon in the given order is our focus. In this paper, we present an improved method to compute the shortest path based on the last step shortest path maps by Dror et al. Instead of using of point location in previous algorithm, we p...
متن کاملTouring a Sequence of Line Segments in Polygonal Domain Fences
In this paper, we consider the problem of touring a sequence of line segments in presence of polygonal domain fences. In this problem there is a sequence S = (s = S0, . . . , Sk, Sk+1 = t) in which s and t are respectively start and target points and S1, . . . , Sk are line segments in the plane. Also, we are given a sequence F = (F0, . . . , Fk) of planar polygonal domains called fences such t...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کامل